/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: ${USER}
 * Date: ${YEAR}-${MONTH}-${DAY}
 * Time: ${TIME}
 */
public class Main {
    public static void main(String[] args) {
        System.out.println("Hello world!");
    }
}import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param pushV int整型一维数组
     * @param popV int整型一维数组
     * @return bool布尔型
     */
    public boolean IsPopOrder (int[] pushV, int[] popV) {
        // write code here
        Stack<Integer> myStack = new Stack<>();
        int j = 0;
        for (int i = 0;i < pushV.length;i++) {
            myStack.add(pushV[i]);
            while (j < popV.length&&!myStack.empty()&&myStack.peek().equals(popV[j])) {
                myStack.pop();
                j++;

            }
        }
        if (j < pushV.length||!myStack.empty()) {
            return false;
        }
        return true;
    }
}
